Minimizing Optimal Transport for Functions with Fixed-Size Nodal Sets
نویسندگان
چکیده
Consider the class of zero-mean functions with fixed $$L^{\infty }$$ and $$L^1$$ norms exactly $$N\in {\mathbb {N}}$$ nodal points. Which f minimize $$W_p(f_+,f_-)$$ , Wasserstein distance between measures whose densities are positive negative parts? We provide a complete solution to this minimization problem on line circle, which provides sharp constants for previously proven “uncertainty principle”-type inequalities, i.e., lower bounds $$N\cdot W_p (f_+, f_-)$$ . further show that, while such inequalities hold in many metric measure spaces, they no longer when non-branching assumption is violated; indeed, star-graphs, optimal bound not inversely proportional size set, N. Based similar reductions, we make connections analogous minimizing defined $$\Omega \subset {R}}^d$$ an equivalent domain partition problem.
منابع مشابه
Inverse nodal problem for p-Laplacian with two potential functions
In this study, inverse nodal problem is solved for the p-Laplacian operator with two potential functions. We present some asymptotic formulas which have been proved in [17,18] for the eigenvalues, nodal points and nodal lengths, provided that a potential function is unknown. Then, using the nodal points we reconstruct the potential function and its derivatives. We also introduce a solution of i...
متن کاملMinimizing Submodular Functions over Families of Sets
We consider the problem of characterizing the minimum of a submodular function when the minimization is restricted to a family of subsets. We show that, for many interesting cases, there exist two elements a and b of the groundset such that the problem is equivalent to the problem of minimizing the submodular function over the sets containing a but not b. This leads to a polynomial-time algorit...
متن کاملOptimal Fixed-Size Controllers for Decentralized POMDPs
Solving decentralized partially observable Markov decision processes (DEC-POMDPs) is a difficult task. Exact solutions are intractable in all but the smallest problems and approximate solutions provide limited optimality guarantees. As a more principled alternative, we present a novel formulation of an optimal fixed-size solution of a DEC-POMDP as a nonlinear program. We discuss the benefits of...
متن کاملPublic transport fleet scheduling for minimizing total transfer waiting time
Public transportation has been one of the most important research fields in the two last decades. The purpose of this paper is to create a schedule for public transport fleets such as buses and metro trains with the goal of minimizing the total transfer waiting time. We extend previous research works in the field of transit schedule with considering headways of each route as decision variables....
متن کاملCurvature and Optimal Algorithms for Learning and Minimizing Submodular Functions
We investigate three related and important problems connected to machine learning: approximating a submodular function everywhere, learning a submodular function (in a PAC-like setting [28]), and constrained minimization of submodular functions. We show that the complexity of all three problems depends on the “curvature” of the submodular function, and provide lower and upper bounds that refine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Nonlinear Science
سال: 2023
ISSN: ['0938-8974', '1432-1467']
DOI: https://doi.org/10.1007/s00332-023-09952-8